Some Schwarz Methods for Symmetric and Nonsymmetric Elliptic Problems

نویسندگان

  • OLOF B. WIDLUND
  • Xuejun Zhang
  • Xiao-Chuan Cai
چکیده

This paper begins with an introduction to additive and multiplicative Schwarz methods. A two-level method is then reviewed and a new result on its rate of convergence is established for the case when the overlap is small. Recent results by Xuejun Zhang, on multi-level Schwarz methods, are formulated and discussed. The paper is concluded with a discussion of recent joint results with Xiao-Chuan Cai on nonsymmetric and indeenite problems.nite elliptic problems AMS(MOS) subject classiications. 65F10, 65N30 1. Introduction. Over the last few years, a general theory has been developed for the study of additive and multiplicative Schwarz methods. Many domain decomposition and certain multigrid methods can now be successfully analyzed inside this framework. Early work by P.-L. Lions 23], 24] gave an important impetus to this eeort. The additive Schwarz methods were then developed by Dryja and Widlund 15], 16], 17], Matsokin and Nepomnyaschikh 25] and Nepomnyaschikh 26] and others. Recent eeorts by Bramble, Pasciak, Wang and Xu 4] and Xu 36] have extended the general framework making a systematic study of multiplicative Schwarz methods possible. The multiplicative algorithms are direct generalizations of the original alternating method discovered more than 120 years ago by H. A. Schwarz 30]. We note that most of the work in recent years has focused on the positive deenite, symmetric case. While this theory is quite general, the applications so far have primarily been to the solution of the often large linear systems of algebraic equations, which arise in the nite element discretization of elliptic and parabolic boundary value problems. As shown in P.-L. Lions 24], the classical Schwarz algorithms can conveniently be described in terms of subspaces of the given space. The relevant error propagation operator of a particular Schwarz method can be written as a polynomial of orthogonal projections onto these subspaces. The use of these projections in computations involves the evaluation of the residual of the original nite element problem and the exact, or approximate, solution of several nite element problems on subregions. An additional coarse discrete model is also often used to enhance the rate of convergence. For a discussion of many applications, see Dryja and Widlund 17]. For other current projects, which also use the Schwarz framework, see Dryja and Widlund 18], 20] and Dryja, Smith and Widlund 14].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative Schwarz Algorithms for Some Nonsymmetric and Indefinite Problems

Abstract The classical Schwarz alternating method has recently been generalized in several directions This e ort has resulted in a number of new powerful domain decomposition methods for elliptic problems in new insight into multigrid methods and in the development of a very useful framework for the analysis of a variety of iterative methods Most of this work has focused on positive de nite sym...

متن کامل

Domain Decomposition Algorithms for Indeenite Elliptic Problems

Iterative methods for linear systems of algebraic equations arising from the nite element discretization of nonsymmetric and indeenite elliptic problems are considered. Methods previously known to work well for positive deenite, symmetric problems are extended to certain nonsymmetric problems, which can also have some eigenvalues in the left half plane. We rst consider an additive Schwarz metho...

متن کامل

A comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems

In recent years competitive domain decomposed preconditioned iterative tech niques have been developed for nonsymmetric elliptic problems In these tech niques a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow e ective solution on parallel machines A central question is how to choose these small problems and how to arrange the or...

متن کامل

A Family of Overlapping Schwarz Algorithms for Nonsymmetric and Indefinite Elliptic Problems

The classical Schwarz alternating method has recently been generalized in several directions This e ort has resulted in a number of new powerful domain decomposition methods for solving general elliptic problems including the nonsymmetric and inde nite cases In this paper we present several overlapping Schwarz preconditioned Krylov space iterative methods for solving elliptic boundary value pro...

متن کامل

Domain Decomposition Algorithms for Indefinite Elliptic Problems

Iterative methods for linear systems of algebraic equations arising from the finite element discretization of nonsymmetric and indefinite elliptic problems are considered. Methods previously known to work well for positive definite, symmetric problems are extended to certain nonsymmetric problems, which can also have some eigenvalues in the left half plane. We first consider an additive Schwarz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992